Test Series - Data Structure

3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

Test Number 13/115

Q: What differentiates a circular linked list from a normal linked list?
A. You cannot have the ‘next’ pointer point to null in a circular linked listYou cannot have the ‘next’ pointer point to null in a circular linked list
B. It is faster to traverse the circular linked list
C. You may or may not have the ‘next’ pointer point to null in a circular linked list
D. Head node is known in circular linked list
Solution: The ‘next’ pointer points to null only when the list is empty, otherwise it points to the head of the list. Every node in a circular linked list can be a starting point(head).
Q: How do you count the number of elements in the circular linked list?
A. public int length(Node head) { int length = 0; if( head == null) return 0; Node temp = head.getNext(); while(temp != head) { temp = temp.getNext(); length++; } return length; }
B. public int length(Node head) { int length = 0; if( head == null) return 0; Node temp = head.getNext(); while(temp != null) { temp = temp.getNext(); length++; } return length; }
C. public int length(Node head) { int length = 0; if( head == null) return 0; Node temp = head.getNext(); while(temp != head && temp != null) { temp = head.getNext(); length++; } return length; }
D. public int length(Node head) { int length = 0; if( head == null) return 0; Node temp = head.getNext(); while(temp != head && temp == null) { temp = head.getNext(); length++; } return length; }
Solution: If the head is null, it means that the list is empty. Otherwise, traverse the list until the head of the list is reached.
Q: What is the functionality of the following piece of code? Select the most appropriate.

public void function(int data)
{
	int flag = 0;
	if( head != null)
	{
		Node temp = head.getNext();
		while((temp != head) && (!(temp.getItem() == data)))
		{
			temp = temp.getNext();
			flag = 1;
			break;
		}
	}
	if(flag)
		System.out.println("success");
	else
		System.out.println("fail");
}
A. Print success if a particular element is not found
B. Print fail if a particular element is not found
C. Print success if a particular element is equal to 1
D. Print fail if the list is empty
Solution: The function prints fail if the given element is not found. Note that this option is inclusive of option “Print fail if the list is empty”, the list being empty is one of the cases covered.
Q: What is the time complexity of searching for an element in a circular linked list?
A. O(n)
B. O(nlogn)
C. O(1)
D. O(n2)
Solution: In the worst case, you have to traverse through the entire list of n elements.
Q: Which of the following application makes use of a circular linked list?
A. Undo operation in a text editor
B. Recursive function calls
C. Allocating CPU to resources
D. Implement Hash Tables
Solution: Generally, round robin fashion is employed to allocate CPU time to resources which makes use of the circular linked list data structure. Recursive function calls use stack data structure. Undo Operation in text editor uses doubly linked lists. Hash tables uses singly linked lists.
Q: Choose the code snippet which inserts a node to the head of the list?
A. public void insertHead(int data) { Node temp = new Node(data); Node cur = head; while(cur.getNext() != head) cur = cur.getNext() if(head == null) { head = temp; head.setNext(head); } else { temp.setNext(head); head = temp; cur.setNext(temp); } size++; }
B. public void insertHead(int data) { Node temp = new Node(data); while(cur != head) cur = cur.getNext() if(head == null) { head = temp; head.setNext(head); } else { temp.setNext(head.getNext()); cur.setNext(temp); } size++; }
C. public void insertHead(int data) { Node temp = new Node(data); if(head == null) { head = temp; head.setNext(head); } else { temp.setNext(head.getNext()); head = temp; } size++; }
D. public void insertHead(int data) { Node temp = new Node(data); if(head == null) { head = temp; head.setNext(head.getNext()); } else { temp.setNext(head.getNext()); head = temp; } size++; }
Solution: If the list is empty make the new node as ‘head’, otherwise traverse the list to the end and make its ‘next’ pointer point to the new node, set the new node’s next point to the current head and make the new node as the head.
Q: What is the functionality of the following code? Choose the most appropriate answer.

public int function()
{
	if(head == null)
		return Integer.MIN_VALUE;
	int var;
	Node temp = head;
	while(temp.getNext() != head)
		temp = temp.getNext();
	if(temp == head)
	{
		var = head.getItem();
		head = null;
		return var;
	}
	temp.setNext(head.getNext());
	var = head.getItem();
	head = head.getNext();
	return var;
}
A. Return data from the end of the list
B. Returns the data and deletes the node at the end of the list
C. Returns the data from the beginning of the list
D. Returns the data and deletes the node from the beginning of the list
Solution: First traverse through the list to find the end node, then manipulate the ‘next’ pointer such that it points to the current head’s next node, return the data stored in head and make this next node as the head.
Q: What is the functionality of the following code? Choose the most appropriate answer.

public int function()
{
	if(head == null)
		return Integer.MIN_VALUE;
	int var;
	Node temp = head;
	Node cur;
	while(temp.getNext() != head)
	{
		cur = temp;
		temp = temp.getNext();
	}
	if(temp == head)
	{
		var = head.getItem();
		head = null;
		return var;
	}
	var = temp.getItem();
	cur.setNext(head);
	return var;
}
A. Return data from the end of the list
B. Returns the data and deletes the node at the end of the list
C. Returns the data from the beginning of the list
D. Returns the data and deletes the node from the beginning of the list
Solution: First traverse through the list to find the end node, also have a trailing pointer to find the penultimate node, make this trailing pointer’s ‘next’ point to the head and return the data stored in the ‘temp’ node.
Q: Which of the following is false about a circular linked list?
A. Every node has a successor
B. Time complexity of inserting a new node at the head of the list is O(1)
C. Time complexity for deleting the last node is O(n)
D. We can traverse the whole circular linked list by starting from any point
Solution: Time complexity of inserting a new node at the head of the list is O(n) because you have to traverse through the list to find the tail node.
Q: Consider a small circular linked list. How to detect the presence of cycles in this list effectively?
A. Keep one node as head and traverse another temp node till the end to check if its ‘next points to head
B. Have fast and slow pointers with the fast pointer advancing two nodes at a time and slow pointer advancing by one node at a time
C. Cannot determine, you have to pre-define if the list contains cycles
D. Circular linked list itself represents a cycle. So no new cycles cannot be generated
Solution: Advance the pointers in such a way that the fast pointer advances two nodes at a time and slow pointer advances one node at a time and check to see if at any given instant of time if the fast pointer points to slow pointer or if the fast pointer’s ‘next’ points to the slow pointer. This is applicable for smaller lists.

You Have Score    /10